Temporal Reasoning in Propositional Interval Neighborhood Logic
نویسنده
چکیده
Interval-based temporal reasoning is an important field of various areas of Computer Science and Artificial Intelligence, such as planning and natural language processing. In this paper we show that the satisfiability problem for one of the most important formalisms for interval-based reasoning, namely Allen’s Interval Algebra, can be reduced to the satisfiability problem for Propositional Neighborhood
منابع مشابه
Propositional Interval Neighborhood Temporal Logics
Logics for time intervals provide a natural framework for dealing with time in various areas of computer science and artificial intelligence, such as planning, natural language processing, temporal databases, and formal specification. In this paper we focus our attention on propositional interval temporal logics with temporal modalities for neighboring intervals over linear orders. We study the...
متن کاملUsing Temporal Logic for Spatial Reasoning: Temporalized Propositional Neighborhood Logic
In this paper we develop a new modal logic for spatial reasoning called Temporalized Propositional Neighborhood Logic, which is the result of the application of a known technique called temporalization to a known temporal logic for spatial reasoning (PNL). We will show that our logic is expressive enough to formalize interesting spatial statements and that it is decidable in NEXPTIME.
متن کاملA Decidable Logic for Time Intervals: Propositional Neighborhood Logic
Logics for time intervals provide a natural framework for representing and reasoning about timing properties in various areas of artificial intelligence and computer science. Unfortunately, most time interval logics proposed in the literature are (highly) undecidable. Decidable fragments of these logics have been obtained by imposing severe restrictions on their expressive power. In this paper,...
متن کاملA Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic
Propositional interval temporal logics are quite expressive temporal logics that allow one to naturally express statements that refer to time intervals. Unfortunately, most such logics turned out to be (highly) undecidable. To get decidability, severe syntactic and/or semantic restrictions have been imposed to interval-based temporal logics that make it possible to reduce them to point-based on...
متن کاملPropositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions
In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics (PNL), we establish their decidability on linearly ordered domains and some important sub-classes, and we prove undecidability of a number of extensions of PNL with additional modalities over interval relations. All together, we show that PNL form a quite expressive and nearly maximal d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005